AGG 2.0 - New Features for Specifying and Analyzing Algebraic Graph Transformations
نویسندگان
چکیده
The integrated development environment AGG supports the specification of algebraic graph transformation systems based on attributed, typed graphs with node type inheritance, graph rules with application conditions, and graph constraints. It offers several analysis techniques for graph transformation systems including graph parsing, consistency checking of graphs as well as conflict and dependency detection in transformations by critical pair analysis of graph rules, an important instrument to support the confluence check of graph transformation systems. AGG 2.0 includes various new features added over the past two years. It supports the specification of complex control structures for rule application comprising the definition of control and object flow for rule sequences and nested application conditions. Furthermore, new possibilities for constructing rules from existing ones (e.g., inverse, minimal, amalgamated, and concurrent rules) and for more flexible usability of critical pair analyses have been realized.
منابع مشابه
AGG: A Tool Environment for Algebraic Graph Transformation
AGG is a general tool environment for algebraic graph transformation which follows the interpretative approach. Its special power comes from a very exible attribution concept. AGG graphs are allowed to be attributed by any kind of Java objects. Graph transformations can be equipped with arbitrary computations on these Java objects described by a Java expression. The AGG environment consists of ...
متن کاملAGG: A Graph Transformation Environment for Modeling and Validation of Software
AGG is a general development environment for algebraic graph transformation systems which follows the interpretative approach. Its special power comes from a very flexible attribution concept. AGG graphs are allowed to be attributed by any kind of Java objects. Graph transformations can be equipped with arbitrary computations on these Java objects described by a Java expression. The AGG environ...
متن کاملTransfer of Local Confluence and Termination between Petri Net and Graph Transformation Systems Based on M-Functors
Recently, a formal relationship between Petri net and graph transformation systems has been established using the new framework of M -functors F : (C1,M1) → (C2,M2) between M -adhesive categories. This new approach allows to translate transformations in (C1,M1) into corresponding transformations in (C2,M2) and, vice versa, to create transformations in (C1,M1) from those in (C2,M2). This is help...
متن کاملForschungsberichte der Fakultät IV – Elektrotechnik und Informatik Transfer of Local Confluence and Termination between Petri Net and Graph Transformation Systems Based on M-Functors: Extended Version
Recently, a formal relationship between Petri net and graph transformation systems has been established using the new framework of M-functors F : (C1,M1) → (C2,M2) between M-adhesive categories. This new approach allows to translate transformations in (C1,M1) into corresponding transformations in (C2,M2) and, vice versa, to create transformations in (C1,M1) from those in (C2,M2). This is helpfu...
متن کاملAmalgamated Graph Transformations and Their Use for Specifying AGG - an Algebraic Graph Grammar System
ion levels. The formal de nition of this concept which can be found in e.g. [Bey92] regards graphs as a set of objects with three partial functions: the source, target, and abstraction function. They are totalized by including a special object ?. A node is an object for which both the source and target function are unde ned. There are a few rather obvious consistency conditions that are enforce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011